A probabilistic model for run-length coding of pictures

[81 BIBLIOGRAPHY R. W. Hamming, “Error correcting and error detecting codes,” Bell Sys. Tech. J., vol. 29, pp. 147-160.; April, 1950. D. Slepian, “A class of binary signaling alphabets,” Bell Sys. Tech. J., vol. 35, pp. 203-234; January, 1956. I. S. Reed, “A class of multiple-error-correcting codes and the decoding scheme,” IRE TRANS. ON INFORMATiON THEORY, vol. IT-4, pp. 38-49; September, 1954. J. H. Green, Jr. and R. L. San Soucie, “An error correcting encoder and decoder of high efficiency,” PROC. IRE, vol. 46, gp. g”,iKl,‘,‘4?‘; October, 1958. i Several Bmary-Sequence Generators,” Lincoln Lab., M.I.$., Lexington, Mass., Tech. Rept. No. 95; September 12, 1955. S. W. Golomb, “Sequences With Randomness Properties,” Glenn L. Martin Co., Baltimore, Md., Final Rept. on Contract No. W 36-039SC-54-36611; June 14, 1955. B. Elspas, “Theory of autonomous linear sequential networks,” IRE TRANS. ON CIRCUIT THEORY, vol. CT-6, pp. 45-60; March, 1959. R. W. Marsh, “Table of Irreducible Polynomials Over GF(2) Through Degree 19,” National Security Agency, Washington, D. C., October 24, 1957.